A Fast Sweeping Method for . . .
ثبت نشده
چکیده
منابع مشابه
A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations
We develop a fast sweeping method for static Hamilton-Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and unstructured meshes. With causality correctly enforced during sweepings numerical evidence indicates that the fast sweeping method converges in a finite number of iterations independent of mesh size. Numerical examples validate both ...
متن کاملParallel Implementations of the Fast Sweeping Method
The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iterations with alternating sweeping orderings. In this paper several parallel implementations of the fast sweeping method are presented. These parallel algorithms are simple and efficient due to the causality of the underlying partial different equations. Numerical examples are used to v...
متن کاملFast Sweeping Fifth Order WENO Scheme for Static Hamilton-Jacobi Equations with Accurate Boundary Treatment
A fifth order weighted essentially non-oscillatory (WENO) fast sweeping method is designed in this paper, extending the result of the third order WENO fast sweeping method in J. Sci. Comput. 29, 25–56 (2006) and utilizing the two approaches of accurate inflow boundary condition treatment in J. Comput. Math. 26, 1–11 (2008), which allows the usage of Cartesian meshes regardless of the domain bou...
متن کاملUniformly Accurate Discontinuous Galerkin Fast Sweeping Methods for Eikonal Equations
In [F. Li, C.-W. Shu, Y.-T. Zhang, H. Zhao, Journal of Computational Physics 227 (2008) 81918208], we developed a fast sweeping method based on a hybrid local solver which is a combination of a discontinuous Galerkin (DG) finite element solver and a first order finite difference solver for Eikonal equations. The method has second order accuracy in the L norm and a very fast convergence speed, b...
متن کاملA Third Order Fast Sweeping Method with Linear Computational Complexity for Eikonal Equations
Fast sweeping methods are a class of efficient iterative methods for solving steady state hyperbolic PDEs. They utilize the Gauss-Seidel iterations and alternating sweeping strategy to cover a family of characteristics of the hyperbolic PDEs in a certain direction simultaneously in each sweeping order. The first order fast sweeping method for solving Eikonal equations (Zhao in Math Comput 74:60...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008